Effects of carbonate on the electrolytic removal of ammonia and urea from urine with thermally prepared IrO2 electrodes

Recent studies have shown that electrolysis can be an efficient process for nitrogen removal from urine. These studies have been conducted with urea solutions or fresh urine, but urine collected in NoMix toilets and urinals has a substantially different composition, because bacteria hydrolyse urea quickly to ammonia and carbonate. In this study, we compared electrochemical removal of nitrogen from synthetic solutions of fresh and stored urine using IrO2 anodes. We could show that in fresh urine both ammonia and urea are efficiently eliminated, mainly through chlorine-mediated oxidation. However, in stored urine the presence of carbonate, arising from urea hydrolysis, leads to an inhibition of ammonia oxidation. We suggest two parallel mechanisms to explain this effect: the competition between chloride and carbonate oxidation at the anode and the competition between chlorate formation, enhanced by the buffering effect of carbonate, and ammonia oxidation for the consumption of active chlorine in the bulk. However, further experiments are needed to support the latter mechanism. In conclusion, this study highlights the negative consequences of the presence of carbonate in urine solutions, but also in other wastewaters, when subjected to an electrolytic treatment on IrO2 in alkaline media

Pessimistic Software Lock-Elision

Read-write locks are one of the most prevalent lock forms in concurrent applications because they allow read accesses to locked code to proceed in parallel. However, they do not offer any parallelism between reads and writes. This paper introduces pessimistic lock-elision (PLE), a new approach for non-speculatively replacing read-write locks with pessimistic (i.e. non-aborting) software transactional code that allows read-write concurrency even for contended code and even if the code includes system calls. On systems with hardware transactional support, PLE will allow failed transactions, or ones that contain system calls, to preserve read-write concurrency. Our PLE algorithm is based on a novel encounter-order design of a fully pessimistic STM system that in a variety of benchmarks spanning from counters to trees, even when up to 40% of calls are mutating the locked structure, provides up to 5 times the performance of a state-of-the-art read-write lock.National Science Foundation (U.S.) (Grant 1217921

Inventory control for point-of-use locations in hospitals

Most inventory management systems at hospital departments are characterised by lost sales, periodic reviews with short lead times, and limited storage capacity. We develop two types of exact models that deal with all these characteristics. In a capacity model, the service level is maximised subject to a capacity restriction, and in a service model the required capacity is minimised subject to a service level restriction. We also formulate approximation models applicable for any lost-sales inventory system (cost objective, no lead time restrictions etc). For the capacity model, we develop a simple inventory rule to set the reorder levels and order quantities. Numerical results for this inventory rule show an average deviation of 1% from the optimal service levels. We also embed the single-item models in a multi-item system. Furthermore, we compare the performance of fixed order size replenishment policies and (R, s, S) policies